Characterisation of Strongly Normalising lambda-mu-Terms
نویسندگان
چکیده
We provide a characterisation of strongly normalising terms of the λμ-calculus by means of a type system with intersection and product types. The presence of the latter and a restricted use of the type ω enable us to represent the particular notion of continuation used in the literature for the definition of semantics for the λμ-calculus. This makes it possible to lift the well-known characterisation property for strongly-normalising λ-terms that uses intersection types to the λμ-calculus. From this result an alternative proof of strong normalisation for terms typeable in Parigot’s propositional logical system follows, by means of an interpretation of that system into ours.
منابع مشابه
Characterising Strongly Normalising Intuitionistic Terms
This paper gives a characterisation, via intersection types, of the strongly normalising proof-terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. Next...
متن کاملCharacterising Explicit Substitutions whichPreserve
Contrary to all expectations, the-calculus, the canonical simply-typed lambda-calculus with explicit substitutions, is not strongly normalising. This result has led to a proliferation of calculi with explicit substitutions. This paper shows that the reducibility method provides a general criterion when a calculus of explicit substitution is strongly normalising for all untyped lambda-terms that...
متن کاملIntersection Types for the λμ-Calculus
We introduce an intersection type system for the pure λμ-calculus, which is invariant under subject reduction and expansion. The system is obtained by describing Streicher and Reus’s denotational model of continuations in the category of omega-algebraic lattices via Abramsky’s domain logic approach. This provides at the same time an interpretation of the type system and a proof of the completen...
متن کاملCharacterising Strongly Normalising Intuitionistic Sequent Terms
This paper gives a characterisation, via intersection types, of the strongly normalising terms of an intuitionistic sequent calculus (where LJ easily embeds). The soundness of the typing system is reduced to that of a well known typing system with intersection types for the ordinary λ-calculus. The completeness of the typing system is obtained from subject expansion at root position. This paper...
متن کاملA Translation of Intersection and Union Types for the λμ-Calculus
We introduce an intersection and union type system for the λμ-calculus, which includes a restricted version of the traditional unionelimination rule. We give a translation from intersection and union types into intersection and product types, which is a variant of negative translation from classical logic to intuitionistic logic and naturally reflects the structure of strict intersection and un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012